﻿

мат.
допустимое порядковое число

English-Russian scientific dictionary. 2008.

### Смотреть что такое "admissible ordinal" в других словарях:

• Admissible ordinal — In set theory, an admissible ordinal is any ordinal number α such that Lα is a standard set model of Kripke–Platek set theory. In this case, Lα is said to be an admissible set.The first two admissible ordinals are ω and omega 1^{mathrm{CK (the… …   Wikipedia

• Large countable ordinal — In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of… …   Wikipedia

• Kripke–Platek set theory — The Kripke–Platek axioms of set theory (KP) (IPAEng|ˈkrɪpki ˈplɑːtɛk) are a system of axioms of axiomatic set theory, developed by Saul Kripke and Richard Platek. The axiom system is written in first order logic; it has an infinite number of… …   Wikipedia

• Hyperarithmetical theory — In recursion theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second order arithmetic and with weak systems of set theory such as Kripke–Platek set theory. It is an… …   Wikipedia

• List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

• Alpha recursion theory — In recursion theory, the mathematical theory of computability, alpha recursion (often written α recursion) is a generalisation of recursion theory to subsets of admissible ordinals alpha. An admissible ordinal is closed under Sigma 1(L alpha)… …   Wikipedia

• Kripke–Platek set theory with urelements — The Kripke–Platek set theory with urelements (KPU) is an axiom system for set theory with urelements that is considerably weaker than the familiar system ZF. PreliminariesThe usual way of stating the axioms presumes a two sorted first order… …   Wikipedia

• Lemme De Zorn — En mathématiques, Le lemme de Zorn (ou théorème de Zorn, ou parfois lemme de Kuratowski Zorn), est un théorème de la théorie des ensembles qui affirme qu un ensemble ordonné tel que toute chaîne (sous ensemble totalement ordonné) possède un… …   Wikipédia en Français

• Lemme de Zorn — En mathématiques, le lemme de Zorn (ou théorème de Zorn, ou parfois lemme de Kuratowski Zorn), est un théorème de la théorie des ensembles qui affirme que si un ensemble ordonné est tel que toute chaîne (sous ensemble totalement ordonné) possède… …   Wikipédia en Français

• RÉCURSIVITÉ — Les (semi ) fonctions récursives ont été introduites pour donner un équivalent mathématique à la notion métamathématique intuitive de (semi ) fonction effectivement ou mécaniquement calculable (cf. LOGIQUE MATHÉMATIQUE, chap. 4). Par souci de… …   Encyclopédie Universelle

• Aggregated Indices Randomization Method — (AIRM) is a modification of well known aggregated indices method being aimed at complex objects multi criteria estimation under uncertainty. The main advantage of AIRM over other variants of aggregated indices methods is its ability to use non… …   Wikipedia

### Книги

Другие книги по запросу «admissible ordinal» >>

### Поделиться ссылкой на выделенное

##### Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.